Power-Grid-Partitioning Model and its Tabu-Search-Embedded Algorithm for Zonal Pricing

Power grid partition is a major problem in power markets based on zonal marginal price (ZMP). As the preparation of modeling, the zone of a node set is defined as the minimum-girthed convex polygon containing these nodes, and a theorem judging common nodes between two zones of node sets is proposed. Then, the power-grid-partitioning problem is described as a combinatorial optimization model, and solved by a heuristic algorithm embedded by tabu search (TS). Finally, two actual examples comprising 27 and 323 nodes from northeastern power grid of China prove the validity of the proposed algorithm. In contrast to other partitioning methods, the proposed one in this paper is electrical-information considered and automatically finished, and therefore applicable to actual power system.